package cn.datastruct.five;

public class QuickSort {
    public static void main(String[] args) {
        int[] arr = {28, 3, 0, -3, 19, 30, -8};
    }

    /**
     *
     * @param arr 待排序的数组
     * @param left 数组的最左边下标
     * @param right 右边下标
     */
    public static void quickSort(int[] arr, int left, int right){
        int mid = (left + right) / 2;
        int l = left;
        int r = right;
        int temp = 0;//交换中间值
        int privot = arr[mid];//中间值
        while(l != r){//没有重合
            if(arr[l] > privot){
                
            }
        }
    }
}
